Similarity Measurement Method between Two Songs by Using the Conditional Euclidean Distance

نویسندگان

  • Min Woo Park
  • Eui Chul Lee
چکیده

Since numerous songs have recently been released increasingly, the genre of the song clustering is reasonably more important in terms of the audience’s choice. Also arguments for plagiarism are continuously being raised. For this reason, similarity measurement between two songs is important. In previous works, although similarity measurement has been actively researched in the field of query by humming, they only focused on quite partial matching for input humming. To solve this problem, we proposed a novel similarity measurement method between two songs. The proposed method has several advantages compared with previous works. Firstly, it is possible to measure overall similarity between two different songs. Secondly, overall region of a song is represented as 1-dimensional signal which can be obtained by run-length representation of 2-dimensional note information ((pitch, duration)). Thirdly, by sequentially adopting median filter, average filter, Z-score normalization into the 1-dimensional signal, we obtain the overall flow without noise feature such as the eccentric note of the song. Lastly, a new distance metric namely the conditional Euclidean distance is used by combining two distance concepts such as the Euclidean distance and the Hamming distance. To perform the feasibility test, several famous songs by the Beatles and the MIREX`08 dataset were used for our experiment. Also, by applying our method into a comparison between two songs with a plagiarism issue, we confirmed that very high similarity score between the two songs was measured. Key-Words: Music similarity measurement, Music clustering, Music plagiarism

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning a Metric for Music Similarity

This paper describe five different principled ways to embed songs into a Euclidean metric space. In particular, we learn embeddings so that the pairwise Euclidean distance between two songs reflects semantic dissimilarity. This allows distance-based analysis, such as for example straightforward nearest-neighbor classification, to detect and potentially suggest similar songs within a collection....

متن کامل

Labrosa’s Audio Music Similarity and Classification Submissions

We have submitted a system to MIREX 2007’s audio music similarity and classification tasks. It employs spectral features based on [1] and temporal features similar to those described in [3]. For the similarity task, it calculates the distance between songs as the Euclidean distance between their feature vectors. For the audio classification tasks (artist, classical composer, genre, and mood ide...

متن کامل

Cover Song Identification with Metric Learning Using Distance as a Feature

Most of cover song identification algorithms are based on the pairwise (dis)similarity between two songs which are represented by harmonic features such as chroma, and therefore the choice of a distance measure and a feature has a significant impact on performance. Furthermore, since the similarity measure is query-dependent, it cannot represent an absolute distance measure. In this paper, we p...

متن کامل

Optimal similarity and rotation angle retrieval using Zernike moments

This paper presents a novel and robust algorithm that retrieves the rotation angle between two different patterns, together with their similarity degree. The result is optimal in the sense that it minimizes the euclidean distance between the two images. This approach is based on Zernike moments and constitutes a new way to compare two Zernike descriptors that improves standard Euclidean approac...

متن کامل

Video-Based Face Recognition Using Earth Mover's Distance

In this paper, we present a novel approach of using Earth Mover’s Distance for video-based face recognition. General methods can be classified into sequential approach and batch approach. Batch approach is to compute a similarity function between two videos. There are two classical batch methods. The one is to compute the angle between subspaces, and the other is to find K-L divergence between ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014